Reliability of Data Allocation on a Centralized Service Configuration with Distributed Servers
نویسندگان
چکیده
This paper presents a stochastic model to evaluate the reliability and availability of a network service configuration consisting of a centralized database server and two distributed database server sets for a local/metropolitan area network. The centralized server monitors and controls the distributed database servers, which can be remotely separated from each other and from the center by almost any distance depending on the means of information transmission media between the center and the distributed servers. Using exponential time to failure and time to repair distributions for each of the database servers, exact numerical solutions are obtained for the steady state service reliability and availability measures. The results are then compared to approximate steady state numerical solutions for the general Weibull distribution case under different initial conditions. Finally, the model is extended to the case of three distributed database server sets. The reliability and availability study of such configurations has many applications in widely used internet services, mission-critical business fault tolerant systems, and automated manufacturing and service industries. A decision tool for the computer center manager to assess an upgrade to a three distributed database system from a two database system is also presented.
منابع مشابه
Fully Distributed Service Configuration Management
Configuration management in today’s data centers is largely a human activity. Where automation does exist it is usually implemented by centralized management tools that coordinate configuration actions across the entire infrastructure and applications. These systems are limited in scale, reliability, and security. We propose that dependable service configuration management is more naturally imp...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملPelican DHCP Automated Self-Registration System: Distributed Registration and Centralized Management
Pelican is an automated DHCP client self-registration tool. Unlike other popular selfregistration tools, the Pelican registration system runs on an independent server with no access to the DHCP daemon’s lease data or configuration files. It derives MAC addresses by SNMPquerying network devices and periodically generating and pushing updated configuration files to all participating DHCP servers....
متن کاملHF-Blocker: Detection of Distributed Denial of Service Attacks Based On Botnets
Abstract—Today, botnets have become a serious threat to enterprise networks. By creation of network of bots, they launch several attacks, distributed denial of service attacks (DDoS) on networks is a sample of such attacks. Such attacks with the occupation of system resources, have proven to be an effective method of denying network services. Botnets that launch HTTP packet flood attacks agains...
متن کاملProportional Service Allocation in Distributed Storage Systems
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are a number of algorithms for providing differentiated quality of service to clients of a centralized storage system, the problem has not been solved for distributed storage systems. Providing performance guarantees in d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 49 شماره
صفحات -
تاریخ انتشار 2006